Using computational intelligence for large scale air route networks design

نویسندگان

  • Kaiquan Cai
  • Jun Zhang
  • Chi Zhou
  • Xianbin Cao
  • Ke Tang
چکیده

Due to the rapid development of air transportation, Air Route Networks (ARNs) need to be carefully designed to improve both efficiency and safety of air traffic service. The Crossing Waypoints Location Problem (CWLP) plays a crucial role in the design of an ARN. This paper investigates this problem in the context of designing the national ARN of China. Instead of adopting the single-objective formulation established in previous research, we propose to formulate CWLP as a bi-objective optimization problem. An algorithm named Memetic Algorithm with Pull–Push operator (MAPP) is proposed to tackle it. MAPP employs the Pull–Push operator, which is specifically designed for CWLP, for local search and the Comprehensive Learning Particle Swarm Optimizer for global search. Empirical studies using real data of the current national ARN of China showed that MAPP outperformed an existing approach to CWLP as well as three well-known Multi-Objective Evolutionary Algorithms (MOEAs). Moreover, MAPP not only managed to reduce the cost of the current ARN, but also improved the airspace safety. Hence, it has been implemented as a module in the software that is currently used for ARN planning in China. The data used in our experimental studies have been made available online and can be used as a benchmark problem for research on both ARN design and evolutionary multi-objective optimization. © 2012 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SEISMIC DESIGN OF DOUBLE LAYER GRIDS BY NEURAL NETWORKS

The main contribution of the present paper is to train efficient neural networks for seismic design of double layer grids subject to multiple-earthquake loading. As the seismic analysis and design of such large scale structures require high computational efforts, employing neural network techniques substantially decreases the computational burden. Square-on-square double layer grids with the va...

متن کامل

COMPUTATIONALLY EFFICIENT OPTIMUM DESIGN OF LARGE SCALE STEEL FRAMES

Computational cost of metaheuristic based optimum design algorithms grows excessively with structure size. This results in computational inefficiency of modern metaheuristic algorithms in tackling optimum design problems of large scale structural systems. This paper attempts to provide a computationally efficient optimization tool for optimum design of large scale steel frame structures to AISC...

متن کامل

Addressing a fixed charge transportation problem with multi-route and different capacities by novel hybrid meta-heuristics

In most real world application and problems, a homogeneous product is carried from an origin to a destination by using different transportation modes (e.g., road, air, rail and water). This paper investigates a fixed charge transportation problem (FCTP), in which there are different routes with different capacities between suppliers and customers. To solve such a NP-hard problem, four meta-heur...

متن کامل

Optimal Design of the Cross-docking in Distribution Networks: Heuristic Solution Approach

A design problem of cross-docking distribution networks is addressed as a new research area in logistics management. This paper presents a new mathematical model for the location of cross-docking facilities and vehicle routing scheduling problems in distribution networks. For this purpose, a two-phase mixed-integer programming (MIP) is formulated. Then, a new heuristic-based simulated annealing...

متن کامل

A New Routing Algorithm for Vehicular Ad-hoc Networks based on Glowworm Swarm Optimization Algorithm

Vehicular ad hoc networks (VANETs) are a particular type of Mobile ad hoc networks (MANET) in which the vehicles are considered as nodes. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles. In this paper, a new routing protocol based on glowworm swarm optimization algorithm is provided. Using the g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Appl. Soft Comput.

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2012